Counting domino trains

نویسنده

  • Antonio M. Oller-Marcén
چکیده

In this paper we present a way to count the number of trains that we can construct with a given set of domino pieces. As an application we obtain a new method to compute the total number of eulerian paths in an undirected graph as well as their starting and ending vertices. Resumen. En este art́ıculo presentamos una manera de contar el número de trenes que se puede construir con un determinado conjunto de fichas de dominó. Como una aplicación se obtiene un nuevo método para calcular el número total de caminos eulerianos en un grafo no dirigido, aśı como sus vértices inicial y final.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Counting Domino Tilings of Rectangles via Resultants

The classical cosine formula for enumerating domino tilings of a rectangle, due to Kasteleyn, Temperley, and Fisher is proved using a combination of standard tools from combinatorics and algebra. For further details see [4].

متن کامل

Sandpiles and Dominos

We consider the subgroup of the abelian sandpile group of the grid graph consisting of configurations of sand that are symmetric with respect to central vertical and horizontal axes. We show that the size of this group is (i) the number of domino tilings of a corresponding weighted rectangular checkerboard; (ii) a product of special values of Chebyshev polynomials; and (iii) a double-product wh...

متن کامل

Mental arithmetic leads to multiple discrete changes from baseline in the firing patterns of human thalamic neurons.

Primate thalamic action potential bursts associated with low-threshold spikes (LTS) occur during waking sensory and motor activity. We now test the hypothesis that different firing and LTS burst characteristics occur during quiet wakefulness (spontaneous condition) versus mental arithmetic (counting condition). This hypothesis was tested by thalamic recordings during the surgical treatment of t...

متن کامل

A Reconfigurable Network Architecture For Parallel Prefix Counting

We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the discharging signals can propagate along the switch chain asynchronously and produce a semaphore to indicate the end of each domino process. This results in a network that is fast and highly hardwarecompact. The proposed architecture for...

متن کامل

An Efficient VLSI Architecture Parallel Prefix Counting With Domino Logic

We propose an efficient reconfigurable parallel prefix counting network based on the recently-proposed technique of shift switching with domino logic, where the charge/discharge signals propagate along the switch chain producing semaphores results in a network that is fast and highly hardware-compact. The proposed architecture for prefix counting N 1 bits features a total delay of (4 logN +pN 2...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012